Concurrency with partial information
نویسنده
چکیده
The aim of this paper is to introduce a new formalism for multi-agent systems that captures (true) concurrency and independence. We begin describing a complete and decidable propositional multi-modal logic. The language, similar to Propositional Dynamic Logic in many aspects, di ers from usual modal logic: modal operators are non-atomic (they are built out of basic actions) and capture concurrency at the syntactic level. Quanti ed logics are obtained by allowing quanti ers to occur in the modal operators. The semantics of quanti ed formulas uses both set-theoretic and game-theoretic notions (here introduced only informally.)
منابع مشابه
A Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملProperty-Driven Cooperative Logging for Concurrency Bugs Replication
This paper presents property-driven partial logging, a novel information partition scheme that takes into account load balancing and shared variable properties to optimize the replay of Java concurrency bugs through partial log combination. Preliminary evaluation with standard benchmarks and a real-world application provides initial evidence of the feasibility of our approach.
متن کاملPOD - A Tool For Process Discovery Using Partial Orders and Independence Information
Current process discovery techniques focus on the derivation of a process model on the basis of the activity relations extracted from an event log. However, there are situations where more knowledge can be provided to the discovery algorithm, thus alleviating the discovery challenge. In particular, the (partial) characterization of the independence or concurrency between a pair of activities ma...
متن کاملOn Partial Order Characterizations of Information Structures
The degree of concurrency possible in an informationally decentralized nonsequential system is determined by the precedence constraints imposed by the system's information structure on its controlled and uncontrolled inputs. One approach to characterizing these constraints is to attempt to associate each realization of the system's inputs with the strongest partial ordering of the sys-tem's dec...
متن کاملLoad Elimination in the Presence of Side Effects, Concurrency and Precise Exceptions
Partial redundancy elimination can reduce the number of loads corresponding to field and array accesses in Java programs. The reuse of values loaded from memory at subsequent occurrences of load expressions must be done with care: Precise exceptions and the potential of side effects through method invocations and concurrent modifications in multi-threaded programs must be considered. This work ...
متن کامل